0.03/0.12	% Problem    : theBenchmark.p : TPTP v0.0.0. Released v0.0.0.
0.03/0.13	% Command    : run_E %s %d THM
0.13/0.34	% Computer : n017.cluster.edu
0.13/0.34	% Model    : x86_64 x86_64
0.13/0.34	% CPU      : Intel(R) Xeon(R) CPU E5-2620 v4 @ 2.10GHz
0.13/0.34	% Memory   : 8042.1875MB
0.13/0.34	% OS       : Linux 3.10.0-693.el7.x86_64
0.13/0.34	% CPULimit   : 960
0.13/0.34	% WCLimit    : 120
0.13/0.34	% DateTime   : Tue Aug  9 03:49:00 EDT 2022
0.13/0.34	% CPUTime    : 
0.20/0.47	Running higher-order on 8 cores theorem proving
0.20/0.47	Running: /export/starexec/sandbox/solver/bin/eprover-ho --delete-bad-limit=2000000000 --definitional-cnf=24 -s --print-statistics -R --print-version --proof-object --auto-schedule=8 --cpu-limit=120 /export/starexec/sandbox/benchmark/theBenchmark.p
0.20/0.47	# Version: 3.0pre003-ho
0.20/0.48	# Preprocessing class: HSMSSMSSMLSNHSN.
0.20/0.48	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.48	# Starting new_ho_10_cnf2 with 600s (5) cores
0.20/0.48	# Starting post_as_ho3 with 120s (1) cores
0.20/0.48	# Starting post_as_ho11 with 120s (1) cores
0.20/0.48	# Starting full_lambda_8 with 120s (1) cores
0.20/0.48	# post_as_ho3 with pid 30240 completed with status 0
0.20/0.48	# Result found by post_as_ho3
0.20/0.48	# Preprocessing class: HSMSSMSSMLSNHSN.
0.20/0.48	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.48	# Starting new_ho_10_cnf2 with 600s (5) cores
0.20/0.48	# Starting post_as_ho3 with 120s (1) cores
0.20/0.48	# No SInE strategy applied
0.20/0.48	# Search class: HGHNF-FFSF00-SHSSMFNN
0.20/0.48	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.48	# Starting new_ho_10 with 65s (1) cores
0.20/0.48	# new_ho_10 with pid 30245 completed with status 0
0.20/0.48	# Result found by new_ho_10
0.20/0.48	# Preprocessing class: HSMSSMSSMLSNHSN.
0.20/0.48	# Scheduled 4 strats onto 8 cores with 120 seconds (960 total)
0.20/0.48	# Starting new_ho_10_cnf2 with 600s (5) cores
0.20/0.48	# Starting post_as_ho3 with 120s (1) cores
0.20/0.48	# No SInE strategy applied
0.20/0.48	# Search class: HGHNF-FFSF00-SHSSMFNN
0.20/0.48	# Scheduled 6 strats onto 1 cores with 120 seconds (120 total)
0.20/0.48	# Starting new_ho_10 with 65s (1) cores
0.20/0.48	# Preprocessing time       : 0.001 s
0.20/0.48	# Presaturation interreduction done
0.20/0.48	
0.20/0.48	# Proof found!
0.20/0.48	# SZS status Theorem
0.20/0.48	# SZS output start CNFRefutation
0.20/0.48	thf(decl_22, type, mrel: mindex > mworld > mworld > $o).
0.20/0.48	thf(decl_23, type, '#pour_b': mindex).
0.20/0.48	thf(decl_24, type, '#make_c': mindex).
0.20/0.48	thf(decl_25, type, '#pour_a': mindex).
0.20/0.48	thf(decl_26, type, mactual: mworld).
0.20/0.48	thf(decl_27, type, mlocal: (mworld > $o) > $o).
0.20/0.48	thf(decl_28, type, mnot: (mworld > $o) > mworld > $o).
0.20/0.48	thf(decl_29, type, mand: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.48	thf(decl_30, type, mor: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.48	thf(decl_31, type, mimplies: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.48	thf(decl_32, type, mequiv: (mworld > $o) > (mworld > $o) > mworld > $o).
0.20/0.48	thf(decl_33, type, mbox: mindex > (mworld > $o) > mworld > $o).
0.20/0.48	thf(decl_34, type, mdia: mindex > (mworld > $o) > mworld > $o).
0.20/0.48	thf(decl_35, type, acid: mworld > $o).
0.20/0.48	thf(decl_36, type, esk1_0: mworld).
0.20/0.48	thf(decl_37, type, esk2_0: mworld).
0.20/0.48	thf(decl_38, type, esk3_0: mworld).
0.20/0.48	thf(decl_39, type, esk4_0: mworld).
0.20/0.48	thf(decl_40, type, esk5_0: mworld).
0.20/0.48	thf(decl_41, type, esk6_0: mworld).
0.20/0.48	thf(decl_42, type, esk7_0: mworld).
0.20/0.48	thf(decl_43, type, esk8_0: mworld).
0.20/0.48	thf(decl_44, type, esk9_0: mworld).
0.20/0.48	thf(mlocal_def, axiom, ((mlocal)=(^[X1:mworld > $o]:((X1 @ mactual)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mlocal_def)).
0.20/0.48	thf(mnot_def, axiom, ((mnot)=(^[X2:mworld > $o, X3:mworld]:(~((X2 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mnot_def)).
0.20/0.48	thf(mand_def, axiom, ((mand)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)&(X4 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mand_def)).
0.20/0.48	thf(mdia_def, axiom, ((mdia)=(^[X5:mindex, X1:mworld > $o, X3:mworld]:(?[X6:mworld]:(((mrel @ X5 @ X3 @ X6)&(X1 @ X6)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mdia_def)).
0.20/0.48	thf(mbox_def, axiom, ((mbox)=(^[X5:mindex, X1:mworld > $o, X3:mworld]:(![X6:mworld]:(((mrel @ X5 @ X3 @ X6)=>(X1 @ X6)))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mbox_def)).
0.20/0.48	thf(conj, conjecture, (mlocal @ (mand @ (mdia @ '#pour_a' @ (mnot @ acid)) @ (mdia @ '#pour_a' @ (mdia @ '#pour_b' @ acid)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', conj)).
0.20/0.48	thf(pour_a_acid, axiom, (mlocal @ (mbox @ '#pour_a' @ (mnot @ acid))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', pour_a_acid)).
0.20/0.48	thf(mimplies_def, axiom, ((mimplies)=(^[X2:mworld > $o, X4:mworld > $o, X3:mworld]:(((X2 @ X3)=>(X4 @ X3))))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', mimplies_def)).
0.20/0.48	thf(pour_ab_make_axiom_2, axiom, (mlocal @ (mimplies @ (mbox @ '#pour_a' @ (mbox @ '#pour_b' @ (mnot @ acid))) @ (mbox @ '#make_c' @ (mnot @ acid)))), file('/export/starexec/sandbox/benchmark/theBenchmark.p', pour_ab_make_axiom_2)).
0.20/0.48	thf(make_c_acid, axiom, (mlocal @ (mdia @ '#make_c' @ acid)), file('/export/starexec/sandbox/benchmark/theBenchmark.p', make_c_acid)).
0.20/0.48	thf(c_0_10, plain, ((mlocal)=(^[Z0:mworld > $o]:((Z0 @ mactual)))), inference(fof_simplification,[status(thm)],[mlocal_def])).
0.20/0.48	thf(c_0_11, plain, ((mnot)=(^[Z0:mworld > $o, Z1:mworld]:(~((Z0 @ Z1))))), inference(fof_simplification,[status(thm)],[mnot_def])).
0.20/0.48	thf(c_0_12, plain, ((mand)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)&(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mand_def])).
0.20/0.48	thf(c_0_13, plain, ((mdia)=(^[Z0:mindex, Z1:mworld > $o, Z2:mworld]:(?[X6:mworld]:(((mrel @ Z0 @ Z2 @ X6)&(Z1 @ X6)))))), inference(fof_simplification,[status(thm)],[mdia_def])).
0.20/0.48	thf(c_0_14, plain, ((mbox)=(^[Z0:mindex, Z1:mworld > $o, Z2:mworld]:(![X6:mworld]:(((mrel @ Z0 @ Z2 @ X6)=>(Z1 @ X6)))))), inference(fof_simplification,[status(thm)],[mbox_def])).
0.20/0.48	thf(c_0_15, negated_conjecture, ~((?[X19:mworld]:(((mrel @ '#pour_a' @ mactual @ X19)&~(acid @ X19)))&?[X21:mworld]:(((mrel @ '#pour_a' @ mactual @ X21)&?[X20:mworld]:(((mrel @ '#pour_b' @ X21 @ X20)&(acid @ X20))))))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(assume_negation,[status(cth)],[conj]), c_0_10]), c_0_11]), c_0_12]), c_0_13])])).
0.20/0.48	thf(c_0_16, plain, ![X23:mworld]:(((mrel @ '#pour_a' @ mactual @ X23)=>~(acid @ X23))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[pour_a_acid, c_0_10]), c_0_11]), c_0_14])])).
0.20/0.48	thf(c_0_17, plain, ((mimplies)=(^[Z0:mworld > $o, Z1:mworld > $o, Z2:mworld]:(((Z0 @ Z2)=>(Z1 @ Z2))))), inference(fof_simplification,[status(thm)],[mimplies_def])).
0.20/0.48	thf(c_0_18, negated_conjecture, ![X36:mworld, X37:mworld, X38:mworld]:((~(mrel @ '#pour_a' @ mactual @ X36)|(acid @ X36)|(~(mrel @ '#pour_a' @ mactual @ X37)|(~(mrel @ '#pour_b' @ X37 @ X38)|~(acid @ X38))))), inference(shift_quantors,[status(thm)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_15])])])).
0.20/0.48	thf(c_0_19, plain, ![X40:mworld]:((~(mrel @ '#pour_a' @ mactual @ X40)|~(acid @ X40))), inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_16])])).
0.20/0.48	thf(c_0_20, plain, (![X11:mworld]:(((mrel @ '#pour_a' @ mactual @ X11)=>![X10:mworld]:(((mrel @ '#pour_b' @ X11 @ X10)=>~(acid @ X10)))))=>![X12:mworld]:(((mrel @ '#make_c' @ mactual @ X12)=>~(acid @ X12)))), inference(fof_simplification,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[pour_ab_make_axiom_2, c_0_10]), c_0_11]), c_0_17]), c_0_14])])).
0.20/0.48	thf(c_0_21, plain, ?[X22:mworld]:(((mrel @ '#make_c' @ mactual @ X22)&(acid @ X22))), inference(apply_def,[status(thm)],[inference(apply_def,[status(thm)],[make_c_acid, c_0_10]), c_0_13])).
0.20/0.48	thf(c_0_22, negated_conjecture, ![X3:mworld, X6:mworld, X7:mworld]:(((acid @ X3)|~((mrel @ '#pour_a' @ mactual @ X3))|~((mrel @ '#pour_a' @ mactual @ X6))|~((mrel @ '#pour_b' @ X6 @ X7))|~((acid @ X7)))), inference(split_conjunct,[status(thm)],[c_0_18])).
0.20/0.48	thf(c_0_23, plain, ![X3:mworld]:((~((mrel @ '#pour_a' @ mactual @ X3))|~((acid @ X3)))), inference(split_conjunct,[status(thm)],[c_0_19])).
0.20/0.48	thf(c_0_24, plain, ![X29:mworld]:((((mrel @ '#pour_a' @ mactual @ esk3_0)|(~(mrel @ '#make_c' @ mactual @ X29)|~(acid @ X29)))&(((mrel @ '#pour_b' @ esk3_0 @ esk4_0)|(~(mrel @ '#make_c' @ mactual @ X29)|~(acid @ X29)))&((acid @ esk4_0)|(~(mrel @ '#make_c' @ mactual @ X29)|~(acid @ X29)))))), inference(distribute,[status(thm)],[inference(shift_quantors,[status(thm)],[inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[inference(fof_nnf,[status(thm)],[c_0_20])])])])])).
0.20/0.48	thf(c_0_25, plain, ((mrel @ '#make_c' @ mactual @ esk9_0)&(acid @ esk9_0)), inference(skolemize,[status(esa)],[inference(variable_rename,[status(thm)],[c_0_21])])).
0.20/0.48	thf(c_0_26, negated_conjecture, ![X3:mworld, X6:mworld, X7:mworld]:((~((mrel @ '#pour_a' @ mactual @ X3))|~((mrel @ '#pour_a' @ mactual @ X6))|~((mrel @ '#pour_b' @ X3 @ X7))|~((acid @ X7)))), inference(csr,[status(thm)],[c_0_22, c_0_23])).
0.20/0.48	thf(c_0_27, plain, ![X3:mworld]:(((mrel @ '#pour_b' @ esk3_0 @ esk4_0)|~((mrel @ '#make_c' @ mactual @ X3))|~((acid @ X3)))), inference(split_conjunct,[status(thm)],[c_0_24])).
0.20/0.48	thf(c_0_28, plain, (mrel @ '#make_c' @ mactual @ esk9_0), inference(split_conjunct,[status(thm)],[c_0_25])).
0.20/0.48	thf(c_0_29, plain, (acid @ esk9_0), inference(split_conjunct,[status(thm)],[c_0_25])).
0.20/0.48	thf(c_0_30, plain, ![X3:mworld]:(((mrel @ '#pour_a' @ mactual @ esk3_0)|~((mrel @ '#make_c' @ mactual @ X3))|~((acid @ X3)))), inference(split_conjunct,[status(thm)],[c_0_24])).
0.20/0.48	thf(c_0_31, plain, ![X3:mworld]:(((acid @ esk4_0)|~((mrel @ '#make_c' @ mactual @ X3))|~((acid @ X3)))), inference(split_conjunct,[status(thm)],[c_0_24])).
0.20/0.48	thf(c_0_32, negated_conjecture, ![X3:mworld, X6:mworld]:((~((mrel @ '#pour_a' @ mactual @ X3))|~((mrel @ '#pour_b' @ X3 @ X6))|~((acid @ X6)))), inference(condense,[status(thm)],[c_0_26])).
0.20/0.48	thf(c_0_33, plain, (mrel @ '#pour_b' @ esk3_0 @ esk4_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_27, c_0_28]), c_0_29])])).
0.20/0.48	thf(c_0_34, plain, (mrel @ '#pour_a' @ mactual @ esk3_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_30, c_0_28]), c_0_29])])).
0.20/0.48	thf(c_0_35, plain, (acid @ esk4_0), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_31, c_0_28]), c_0_29])])).
0.20/0.48	thf(c_0_36, negated_conjecture, ($false), inference(cn,[status(thm)],[inference(rw,[status(thm)],[inference(rw,[status(thm)],[inference(spm,[status(thm)],[c_0_32, c_0_33]), c_0_34]), c_0_35])]), ['proof']).
0.20/0.48	# SZS output end CNFRefutation
0.20/0.48	# Parsed axioms                        : 31
0.20/0.48	# Removed by relevancy pruning/SinE    : 0
0.20/0.48	# Initial clauses                      : 32
0.20/0.48	# Removed in clause preprocessing      : 16
0.20/0.48	# Initial clauses in saturation        : 16
0.20/0.48	# Processed clauses                    : 38
0.20/0.48	# ...of these trivial                  : 0
0.20/0.48	# ...subsumed                          : 0
0.20/0.48	# ...remaining for further processing  : 38
0.20/0.48	# Other redundant clauses eliminated   : 0
0.20/0.48	# Clauses deleted for lack of memory   : 0
0.20/0.48	# Backward-subsumed                    : 0
0.20/0.48	# Backward-rewritten                   : 5
0.20/0.48	# Generated clauses                    : 14
0.20/0.48	# ...of the previous two non-redundant : 8
0.20/0.48	# ...aggressively subsumed             : 0
0.20/0.48	# Contextual simplify-reflections      : 1
0.20/0.48	# Paramodulations                      : 14
0.20/0.48	# Factorizations                       : 0
0.20/0.48	# NegExts                              : 0
0.20/0.48	# Equation resolutions                 : 0
0.20/0.48	# Propositional unsat checks           : 0
0.20/0.48	#    Propositional check models        : 0
0.20/0.48	#    Propositional check unsatisfiable : 0
0.20/0.48	#    Propositional clauses             : 0
0.20/0.48	#    Propositional clauses after purity: 0
0.20/0.48	#    Propositional unsat core size     : 0
0.20/0.48	#    Propositional preprocessing time  : 0.000
0.20/0.48	#    Propositional encoding time       : 0.000
0.20/0.48	#    Propositional solver time         : 0.000
0.20/0.48	#    Success case prop preproc time    : 0.000
0.20/0.48	#    Success case prop encoding time   : 0.000
0.20/0.48	#    Success case prop solver time     : 0.000
0.20/0.48	# Current number of processed clauses  : 17
0.20/0.48	#    Positive orientable unit clauses  : 7
0.20/0.48	#    Positive unorientable unit clauses: 0
0.20/0.48	#    Negative unit clauses             : 1
0.20/0.48	#    Non-unit-clauses                  : 9
0.20/0.48	# Current number of unprocessed clauses: 2
0.20/0.48	# ...number of literals in the above   : 4
0.20/0.48	# Current number of archived formulas  : 0
0.20/0.48	# Current number of archived clauses   : 21
0.20/0.48	# Clause-clause subsumption calls (NU) : 28
0.20/0.48	# Rec. Clause-clause subsumption calls : 20
0.20/0.48	# Non-unit clause-clause subsumptions  : 2
0.20/0.48	# Unit Clause-clause subsumption calls : 8
0.20/0.48	# Rewrite failures with RHS unbound    : 0
0.20/0.48	# BW rewrite match attempts            : 9
0.20/0.48	# BW rewrite match successes           : 5
0.20/0.48	# Condensation attempts                : 38
0.20/0.48	# Condensation successes               : 1
0.20/0.48	# Termbank termtop insertions          : 2719
0.20/0.48	
0.20/0.48	# -------------------------------------------------
0.20/0.48	# User time                : 0.008 s
0.20/0.48	# System time              : 0.001 s
0.20/0.48	# Total time               : 0.009 s
0.20/0.48	# Maximum resident set size: 1908 pages
0.20/0.48	
0.20/0.48	# -------------------------------------------------
0.20/0.48	# User time                : 0.009 s
0.20/0.48	# System time              : 0.003 s
0.20/0.48	# Total time               : 0.013 s
0.20/0.48	# Maximum resident set size: 1740 pages
0.20/0.48	EOF